Back to course home
0% completed
Vote For New Content
LinkedIn Hard
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Triplet Sum to Zero (medium)
Problem Statement
Given an array of unsorted numbers, find all unique triplets in it that add up to zero.
Examples
Example 1
- Input: [-3, 0, 1, 2, -1, 1, -2]
- Output: [[-3, 1, 2], [-2, 0, 2], [-2, 1, 1], [-1, 0, 1]]
- Explanation: There are four unique triplets whose sum is equal to zero.
Example 2
- Input: [-5, 2, -1, -2, 3]
- Output: [[-5, 2, 3], [-2, -1, 3]]
- Explanation: There are two unique triplets whose sum is equal to zero.
Constraints:
3 <= arr.length <= 3000- -105 <= arr[i] <= 105
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Reverse Integer
Solution: Triplet Sum to Zero
Mark as Completed
On this page
Problem Statement
Examples
Example 2
Try it yourself